Fleet assignment and routing with schedule synchronization constraints
نویسندگان
چکیده
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft ̄eet assignment and routing problems and it proposes an optimal solution approach. This approach is based on Dantzig±Wolfe decomposition/column generation. The resulting master problem consists of ̄ight covering constraints, as in usual applications, and of schedule synchronization constraints. The corresponding subproblem is a shortest path problem with time windows and linear costs on the time variables and it is solved by an optimal dynamic programming algorithm. This column generation procedure is embedded into a branch and bound scheme to obtain integer solutions. A dedicated branching scheme was devised in this paper where the branching decisions are imposed on the time variables. Computational experiments were conducted using weekly ̄eet routing and scheduling problem data coming from an European airline. The test problems are solved to optimality. A detailed result analysis highlights the advantages of this approach: an extremely short subproblem solution time and, after several improvements, a very ecient master problem solution time. Ó 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling
متن کامل
The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملLong Haul Fleet Assignment: Models, Methods and Applications
The fleet assignment problem is an integral part of the airline planning process. Given a schedule of international flights and certain maintenance criteria required by the Federal Aviation Administration (FAA), the objective of the long haul fleet assignment problem is to assign aircraft of different fleet types to different flights such that operating costs are minimized. We develop a new for...
متن کاملTechnical Note: An opportunity cost maintenance scheduling framework for a fleet of ships: A case study
The conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. In this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. The idea is to assign a penalty cost to al...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 119 شماره
صفحات -
تاریخ انتشار 1999